The compression theorem
نویسندگان
چکیده
The compression theorem solves a 20 year old problem [2; problem 6]. Applications include short new proofs for immersion theory and for the loops– suspension theorem of James et al and a new approach to classifying embeddings of manifolds in codimension one or more, which leads to theoretical solutions. The proof introduces a novel technique in differential topology: proof by dynamical systems. We define flows which straighten vector fields and which then allow a given embedding or immersion to be ‘compressed’ to an immersion in a lower dimension. The technique gives explicit descriptions of the resulting immersions and can be seen as a way of desingularising certain maps. An example is the transition from the non-immersion of the projective plane in 3-space as a sphere with cross-cap to Boy’s surface. The result also gives a geometric meaning to the homotopy groups of the rack space [3, 4] and in particular we can construct a classifying space for codimension two embeddings with fundamental group mapping to a given group. It has also been applied by Wiest [17] to prove structure theorems for rack spaces. AMS Classification numbers Primary: 57R25, 57R27, 57R40, 57R42, 57R52 Secondary: 57R20, 57R45, 55P35, 55P40, 55P47
منابع مشابه
The compression theorem II: directed embeddings
This is the second of three papers about the Compression Theorem. We give proofs of Gromov’s theorem on directed embeddings [1; 2.4.5 (C′)] and of the Normal Deformation Theorem [3; 4.7] (a general version of the Compression Theorem). AMS Classification 57R40, 57R42; 57A05
متن کاملThe Data Compression Theorem for Ergodic Quantum Information Sources
We extend the data compression theorem to the case of ergodic quantum information sources. Moreover, we provide an asymptotically optimal compression scheme which is based on the concept of high probability subspaces. The rate of this compression scheme is equal to the von Neumann entropy rate.
متن کاملStationary quantum source coding
In this paper the quantum version of the source coding theorem is obtained for a completely ergodic source. This result extends Schumacher’s quantum noiseless coding theorem for memoryless sources. The control of the memory effects requires some earlier results of Hiai and Petz on high probability subspaces. Our result is equivalently considered as a compression theorem for noiseless stationary...
متن کاملA Krasnoselskĭi Cone Compression Result for Multimaps in the S-kkm Class
The aim of this article is obtain a Krasnoselskĭı cone compression theorem for multimaps in the class S-KKM.
متن کاملThe compression theorem I
This the first of a set of three papers about the Compression Theorem: if M is embedded in Q ×R with a normal vector field and if q−m ≥ 1, then the given vector field can be straightened (ie, made parallel to the given R direction) by an isotopy of M and normal field in Q× R. The theorem can be deduced from Gromov’s theorem on directed embeddings [5; 2.4.5 (C′)] and is implicit in the preceedin...
متن کاملA Rate-Distortion Theorem for Arbitrary Discrete Sources
A rate-distortion theorem for arbitrary (not necessarily stationary or ergodic) discrete-time finite-alphabet sources is given. This result, which provides the expression of the minimum -achievable fixedlength coding rate subject to a fidelity criterion, extends a recent data compression theorem by Steinberg and Verdú.
متن کامل